Small Oriented Cycle Double Cover of Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small cycle cover of 2-connected cubic graphs

Every 2-connected simple cubic graph of order n¿ 6 has a cycle cover with at most n=4 cycles. This bound is best possible. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Classes of line graphs with small cycle double covers

The Small Cycle Double Cover Conjectnre, due to J .A. Bondy, states that every simple bridgeless graph on n vertices has a cycle double cover with at most (n 1) cycles. There are a number of classes of graphs for which this conjecture is known to hold; for example, triangulations of surfaces, complete graphs, and 4-connected planar graphs. In this article, we prove that the conjecture holds for...

متن کامل

Dicycle Cover of Hamiltonian Oriented Graphs

A dicycle cover of a digraphD is a familyF of dicycles ofD such that each arc ofD lies in at least one dicycle inF. We investigate the problem of determining the upper bounds for the minimum number of dicycles which cover all arcs in a strong digraph. Best possible upper bounds of dicycle covers are obtained in a number of classes of digraphs including strong tournaments, Hamiltonian oriented g...

متن کامل

Catherine Greenhill the Cycle Double Cover Conjecture

In the year 2000, exactly one hundred years after David Hilbert posed his now famous list of 23 open problems, The Clay Mathematics Institute (CMI) announced its seven Millennium Problems. (http://www. claymath.org/millennium). The Gazette has asked leading Australian mathematicians to put forth their own favourite ‘Millennium Problem’. Due to the Gazette’s limited budget, we are unfortunately ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society

سال: 2015

ISSN: 0126-6705,2180-4206

DOI: 10.1007/s40840-015-0169-2